Geo/G/1 queues with disasters and general repair times
نویسندگان
چکیده
منابع مشابه
Markov-modulated infinite-server queues with general service times
This paper studies an infinite-server queue in a Markov environment, that is, an infiniteserver queue with an arrival rate that equals λi when an external Markov process is in state i. The service times have a general distribution that depends on the state of the background process upon arrival. We start by setting up explicit formulas for the mean and variance of the number of particles in the...
متن کاملOperational Analysis of Queues with General Service Times
Formulas relating the mean queue length, utilization, and coefficient of variation of service time of a queue during a given observation period are derived using operational analysis. The main formula, a counterpart of the Pollaczek-Khintchin formula for M/G/l queues, relies on four homogeneity assumptions. The other formulas require fewer assumptions. Simulation experiments compare the robustn...
متن کاملQueues with deterministic reneging times
We consider single-server and multi-server queues with deterministic reneging times motivated by the timeout mechanisms used in application servers.. A Volterra integral equation is developed using the level crossing analysis for the M/G/1 queue with reneging. An analytical solution is given for the M/HyperExponential/1 queue with deterministic reneging times and a numerical approach is present...
متن کاملQueues with Nonexponential Failure Times
There are two difficulties with the inclusion of nonexponential failure times in queueing models. The first effect is that the failures will change the mean and variance (as well as higher moments) of the effective service times. The second difficulty is less obvious in that nonexponential failures will eliminate the stochastic independence between successive service times. Using phase-type dis...
متن کاملAnM[X]/G/1 Queue with Bernoulli Schedule General Vacation Times, General Extended Vacations, Random Breakdowns, General Delay Times for Repairs to Start and General Repair Times
Abstract This paper studies a batch arrival queueing system in which the server may face occasional random breakdowns. The repair process does not start immediately after a breakdown and there is a delay time waiting for repairs to start. Further, after every service completion the server has the option to leave for a vacation with probability p or continue serving with probability1 − p. The ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2011
ISSN: 0307-904X
DOI: 10.1016/j.apm.2010.09.032